On non-local propositional and one-variable quantified CTL
نویسندگان
چکیده
Sebastian Bauer,1 Ian Hodkinson,2 Frank Wolter,3 and Michael Zakharyaschev4 1;3Institut für Informatik, Universität Leipzig, Augustus-Platz 10-11, 04109 Leipzig, Germany; 2Department of Computing, Imperial College, 180 Queen’s Gate, London SW7 2BZ, U.K.; 4Department of Computer Science, King’s College, Strand, London WC2R 2LS, U.K. (e-mails: fbauer,[email protected], [email protected], [email protected])
منابع مشابه
On Non-local Propositional and Weak Monodic Quantified CTL
In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional PCTL∗, in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified PCTL∗, where the next-time operator can be applied only to formulas with at mo...
متن کاملDecidable and Undecidable Fragments of First-Order Branching Temporal Logics
In this paper we analyze the decision problem for fragments of first-order extensions of branching time temporal logics such as computational tree logics CTL and CTL or Prior’s Ockhamist logic of historical necessity. On the one hand, we show that the one-variable fragments of logics like first-order C T L —such as the product of propositional C T L with simple propositional modal logic S5, or ...
متن کاملOn Non-local Propositional and Weak Monodic Quantified
In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional , in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified , where the next-time operator can be applied only to formulas with at most one fre...
متن کاملMonodic temporal logic with quantified propositional variables
We extend the monodic fragment of first-order linear temporal logic to include right-linear grammar operators and quantification of propositional variables. Unlike propositional temporal logic, the use of grammar operators in first-order temporal logic is not equivalent to general propositional quantification, as the latter admit satisfiable formulae without countable models. We consider the de...
متن کاملQuantified CTL: expressiveness and model checking
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002